Laplacian Matrix in Algebraic Graph Theory
نویسندگان
چکیده
In this paper we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are unary attributes on the nodes and binary attributes on the edges by using the spectral decomposition of a Hermitian property matrix that can be viewed as a complex analogue of the Laplacian.
منابع مشابه
SIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملSIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
متن کاملSpectral Graph Theory and Applications WS 2011 / 2012 Lecture 2 : Spectra of Graphs
Our goal is to use the properties of the adjacency/Laplacian matrix of graphs to first understand the structure of the graph and, based on these insights, to design efficient algorithms. The study of algebraic properties of graphs is called algebraic graph theory. One of the most useful algebraic properties of graphs are the eigenvalues (and eigenvectors) of the adjacency/Laplacian matrix.
متن کاملAlgebraic aspects of the normalized Laplacian
Spectral graph theory looks at the interplay between the structure of a graph and the eigenvalues of a matrix associated with the graph. Many interesting graphs have rich structure which can help in determining the eigenvalues associated with some particular matrix of a graph. This survey looks at some common techniques in working with and determining the eigenvalues associated with the normali...
متن کاملSpectral characterizations of sun graphs and broken sun graphs
Several matrices can be associated to a graph such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question “Which graphs are determined by their spectrum?” remains a difficult problem in algebraic graph theory. In this article we enlarge the known families of graphs determined by their spectrum by ...
متن کامل